Elementary Belief Revision Operators
نویسندگان
چکیده
Abstract Discussions of the issue iterated belief revision are commonly accompanied by presentation three “concrete” operators: natural, restrained and lexicographic. This raises a natural question: What is so distinctive about these particular methods? Indeed, common axiomatic ground for work on revision, AGM Darwiche-Pearl postulates, leaves open whole range alternative proposals. In this paper, we show that it satisfaction an additional principle “Independence Irrelevant Alternatives”, inspired literature Social Choice, unites sets apart our “elementary” operators. A parallel treatment contraction also given, yielding family elementary operators includes, besides well-known “conservative” “moderate” operators, new operator related to revision.
منابع مشابه
Characterizing Relevant Belief Revision Operators
This paper introduces a framework for relevant belief revision. We represent agent’s beliefs in prime implicants and express agent’s preference on beliefs as a pre-order over terms. We define a belief revision operator via minimising the change of the prime implicants of the existing beliefs and the incoming information with respect to agent’s preferences. We show that such a belief revision op...
متن کاملPrime Implicate-based Belief Revision Operators
A belief revision operator can be seen as a function which takes as input a set of beliefsK and an input formula φ and outputs a new set of beliefs K ?φ. Many of the belief revision schemes that have been defined in the literature require additional input. The extra information they need comes in various forms: relations over subsets of the sets of beliefs [2], epistemic entrenchment relations ...
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کاملThe Compactness of Belief Revision and Update Operators
One of the main challenges in the formal modeling of common-sense reasoning is the ability to cope with the dynamic nature of the world. Among the approaches put forward to address this problem are belief revision and update. Given a knowledge base T , representing our knowledge of the “state of affairs” of the world of interest, we are often led to trust another piece of information P , possib...
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Philosophical Logic
سال: 2022
ISSN: ['1573-0433', '0022-3611']
DOI: https://doi.org/10.1007/s10992-022-09672-6